On modal logic of deductive closure
نویسنده
چکیده
A new modal logic D is introduced. It describes properties of provability by interpreting modality as a deductive closure operator on sets of formulas. Logic D is proven to be decidable and complete with respect to this semantics.
منابع مشابه
Fregean logics
According to Frege’s principle the denotation of a sentence coincides with its truthvalue. The principle is investigated within the context of abstract algebraic logic, and it is shown that taken together with the deduction theorem it characterizes intuitionistic logic in a certain strong sense. A 2nd-order matrix is an algebra together with an algebraic closed set system on its universe. A ded...
متن کاملEpistemic closure and commutative, nonassociative residuated structures
K–axiom–based epistemic closure for explicit knowledge is rejected for even the most trivial cases of deductive inferential reasoning on account of the fact that the closure axiom does not extend beyond a raw consequence relation. The recognition that deductive inference concerns interaction as much as it concerns consequence allows for perspectives from logics of multi–agent information flow t...
متن کاملSuhrawardi's Modal Syllogisms
Suhrawardi’s logic of the Hikmat al-Ishraq is basically modal. So to understand his modal logic one first has to know the non-modal part upon which his modal logic is built. In my previous paper ‘Suhrawardi on Syllogisms’(3) I discussed the former in detail. The present paper is an exposition of his treatment of modal syllogisms. On the basis of some reasonable existential presuppositi...
متن کاملOn a Four-Valued Modal Logic with Deductive Implication
In this paper we propose to enrich the four-valued modal logic associated to Monteiro’s Tetravalent modal algebras (TMAs) with a deductive implication, that is, such that the Deduction Meta–theorem holds in the resulting logic. All this lead us to establish some new connections between TMAs, symmetric (or involutive) Boolean algebras, and modal algebras for extensions of S5, as well as their lo...
متن کاملA Summary of the Habilitation Thesis
In [H1], we develop a fixpoint semantics, the least model semantics, and an SLDresolution calculus in a direct way for positive modal logic programs in basic serial monomodal logics. In [H2], we extend the results and generalize the methods of [H1] for multimodal logics, giving a framework for developing semantics for positive logic programs in serial multimodal logics. In [H3], we report on ou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 141 شماره
صفحات -
تاریخ انتشار 2006